On the complexity of computing with planar algebraic curves
نویسندگان
چکیده
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by Õ(n + nτ): • The computation of isolating regions in C for all complex solutions of the system f = g = 0, • the computation of a separating form for the solutions of f = g = 0, • the computation of the sign of h at all real valued solutions of f = g = 0, and • the computation of the topology of the planar algebraic curve C defined as the real valued vanishing set of the polynomial f . Our bound improves upon the best currently known bounds for the first three problems by a factor of n or more and closes the gap to the state-of-the-art randomized complexity for the last problem.
منابع مشابه
Improved Complexity Bounds for Computing with Planar Algebraic Curves
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملIdentification and "reverse engineering" of Pythagorean-hodograph curves
Methods are developed to identify whether or not a given polynomial curve, specified by Bézier control points, is a Pythagorean–hodograph (PH) curve — and, if so, to reconstruct the internal algebraic structure that allows one to exploit the advantageous properties of PH curves. Two approaches to identification of PH curves are proposed. The first is based on the satisfaction of a system of alg...
متن کاملComputing real inflection points of cubic algebraic curves
Shape modeling using planar cubic algebraic curves calls for computing the real inflection points of these curves since inflection points represents important shape feature. A real inflection point is also required for transforming projectively a planar cubic algebraic curve to the normal form, in order to facilitate further analysis of the curve. However, the naive method for computing the inf...
متن کاملGeometric algorithms for algebraic curves and surfaces
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete – they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation and favoring combinatorial and adaptive numerical methods instead, without spoiling exactness in the overal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 31 شماره
صفحات -
تاریخ انتشار 2015